An efficient message passing technique using route path information in unstructured peer to peer network
نویسندگان
چکیده
Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. The Peer-to-Peer technique is differentiated in to two major forms, Structured P2P and Unstructured P2P. In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system. Unstructured peer-to-peer networks do not provide any algorithm for organization or optimization of network connections. Hence the functions like searching, querying etc. are mostly flooded. In this paper we propose a novel message passing technique in which each peer maintains the route path of the destination with in itself which uses this route path to send and receive messages. This method minimizes the packet flow in the unstructured P2P which occur during flooding technique. Keywords-Peer-to-Peer, Unstructured P2P, Routing.
منابع مشابه
Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks
Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficie...
متن کاملFuzzy-Based Multi-Criteria Routing Algorithm in Mesh Overlay Networks
A multi-criteria routing algorithm running in mesh structured that overlay an unstructured peer-to-peer network is proposed. This approach aims to improve the quality of service routing (QoSR) of the modern distributed application. Using a grid pattern can improve routing remarkably, since it provides alternative and partly disjunctive paths of equal length as well as the ability to measure dis...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملReducing query overhead through route learning in unstructured peer-to-peer network
In unstructured peer-to-peer networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. This is, however, a costly operation since it consumes node and link resources excessively and often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the p...
متن کاملPath Query Routing in Unstructured Peer-to-Peer Networks
In this article, we introduce a way to distribute an index database of XML documents on an unstructured peer-to-peer network with a flat topology (i.e. with no super-peer). We then show how to perform content path query routing in such networks. Nodes in the network maintain a set of Multi Level Bloom Filters that summarises structural properties of XML documents. They propagate part of this in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012